How Formal Concept Lattices Solve a Problem of Ancient Linguistics

نویسنده

  • Wiebke Petersen
چکیده

In his grammar of ancient Sanskrit, Pān. ini represents the phonological classes as intervals of a list. This representation method and especially the actual list constructed by Pān. ini, which is called the Śivasūtras, earns universal admiration. The legend says that god Śiva revealed the Śivasūtras to Pān. ini in order to let him start developing his grammar of Sanskrit. A question still discussed is whether it is possible to shorten the Śivasūtras. In the course of this paper, I am going to prove that this question can be reduced to a question about the graphtheoretical form of a particular formal concept lattice. Furthermore, I show how the Śivasūtras can be reconstructed from Pān. ini’s grammar.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Concept Lattices as Semantic Maps

In this paper, we present an application for formal concept analysis (FCA) by showing how it can help construct a semantic map for a lexical typological study. We show that FCA captures typological regularities, so that concept lattices automatically built from linguistic data appear to be even more informative than traditional semantic maps. While sometimes this informativeness causes unreadab...

متن کامل

Uta Priss

This paper describes a qualitative methodology for comparing and analyzing classification schemes. Theoretical facets are modeled as concept lattices in the sense of formal concept analysis and are used as 'ground' on which the underlying conceptual facets of a classification scheme are visually represented as 'figures'.

متن کامل

Iceberg Query Lattices for Datalog

In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension from a propositional representation to datalog, and the second is the condensed representation of frequent itemsets by means of Formal Concept Analysis (FCA). We combine the notion of frequent datalog queries with ice...

متن کامل

Realization Problem for Formal Concept Analysis

Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A ‘standard’ FCA-workflow starts with some ‘experimental’ data, classifies “objects” and their “attributes” in the data, represents relations between objects and attributes by a number of cross-tables (matrices), couples compatible sets of objects and attributes into concepts, and builds a numbe...

متن کامل

On the Inverse Problem for Generalized One-Sided Concept Lattices

Generalized one-sided concept lattices represent a generalization of the classical concept lattices convenient for analysis of object-attribute models with different types of attributes. Formally, to each objectattribute model (represented by the notion of formal context) there is assigned a pair of concept-forming operators. Fixed points of these operators form a hierarchical structure consist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005